Bounds on Gang Service Scheduling
نویسندگان
چکیده
We deene the bounds of two gang service algorithms, namely time balanced and instruction balanced, using interactivity and throughput based metrics. The work-load is composed of V-RAM jobs, and the architectural model chosen is LogP. We also analyze the eeect of workload and space sharing strategies on the bounds found. The following results are demonstrated: when inter-activity is considered, instruction balanced gang service is the best possible non-clairvoyant algorithm. When the objective is to increase throughput Instruction balanced and time balanced gang service are equivalent algorithms. In this case the preemption strategy is not a determinant factor in performance
منابع مشابه
A Mes Parents
Parallel job scheduling is an important problem whose solution may lead to better utilization of modern parallel computers. It is de ned as : Given the aggregate of all tasks of multiple jobs in a parallel system, nd a spatial and temporal allocation to execute all tasks e ciently . For the purposes of scheduling, we view a computer as a queueing system. An arriving job may wait for some time, ...
متن کاملSolving the Single Machine Problem with Quadratic Earliness and Tardiness Penalties
Nowadays, scheduling problems have a considerable application in production and service systems. In this paper, we consider the scheduling of n jobs on a single machine assuming no machine idleness, non-preemptive jobs and equal process times. In many of previous researches, because of the delivery dalays and holding costs, earliness and tardiness penalties emerge in the form of linear combin...
متن کاملSimulation-Based Average Case Analysis for Parallel Job Scheduling
This paper analyses the resource allocation problem in parallel jobs scheduling, with emphasis given to gang service algorithms. Gang service has been widely used as a practical solution to the dynamic parallel job scheduling problem. To provide a sound analysis of gang service performance, a novel methodology based on the traditional concept of competitive ratio is introduced. Dubbed dynamic c...
متن کاملPerformance Analysis of Gang Scheduling in a Distributed System under Processor Failures
In this paper we study the performance of a distributed system that is subject to hardware failures and subsequent repairs. A special type of scheduling called gang scheduling is considered, under which jobs consist of a number of interacting tasks which are scheduled to run simultaneously on distinct processors. Two different gang scheduling policies used to schedule parallel jobs are examined...
متن کاملImprovements in Parallel Job Scheduling Using Gang Service
Gang scheduling has been widely used as a practical solution to the dynamic parallel job scheduling problem. Parallel threads of a single job are scheduled for simultaneous execution on a parallel computer even if the job does not fully utilize all available processors. Non allocated processors go idle for the duration of the time quantum assigned to the threads. In this paper we propose a clas...
متن کامل